Linear Interval Routing
نویسندگان
چکیده
We study a variant of Interval Routing SK85, LT86] where the routing range associated with every link is represented by a linear (i.e., contiguous) interval with no wrap around. This kind of routing schemes arises naturally in the study of dynamic Preex Routing BLT90]. Linear Interval Routing schemes are precisely the Preex Routing schemes that use an alphabet of one symbol. We characterize the type of networks that admit optimum Linear Interval Routing schemes. It is shown that several well-known interconnection networks such as hypercubes, certain n-tori, and n-dimensional grids all with unit-cost links, have optimum Linear Interval Routing schemes. We also introduce the multi-label Linear Interval Routing schemes where each link may contain more than one label, and we prove several characterization results for these schemes.
منابع مشابه
A green vehicle routing problem with customer satisfaction criteria
This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...
متن کاملCharacterization of Networks Supporting Multi-dimensional Linear Interval Routing Scheme
An Interval routing scheme (IRS) is a well-known, space efficient routing strategy for routing messages in a distributed network. In this scheme, each node of the network is assigned an integer label and each link at each node is labeled with an interval. The interval assigned to a link e at a node v indicates the set of destination addresses of the messages which should be forwarded through e ...
متن کامل4 Conclusions and Open Questions
arose naturally is: Is the bi diam always bounded by O(D 2) for graphs with diameter D ? A negative answer could imply a better lower bound. However, we have recently shown ((EMZ]) that bi diam(G) = (D 2 G), where G is any 2-edge connected graph, and thus the answer to the question is positive (this result was independently proved by D]). It implies that, using the same technique we used, one c...
متن کاملTHE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...
متن کاملOptimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by kcaterpillars and maximal outer planar graphs (MOPS). The routing algorithms are optimum in the sense that the route built between any sourcedestination pair is of minimum length and that the routing function executing at each node has time complexity which is lin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991